Solving Random Systems of Quadratic Equations via Truncated Generalized Gradient Flow
نویسندگان
چکیده
This paper puts forth a novel algorithm, termed truncated generalized gradient flow (TGGF), to solve for x ∈ R/C a system of m quadratic equations yi = |〈ai,x〉|, i = 1, 2, . . . ,m, which even for {ai ∈ R/C}i=1 random is known to be NP-hard in general. We prove that as soon as the number of equations m is on the order of the number of unknowns n, TGGF recovers the solution exactly (up to a global unimodular constant) with high probability and complexity growing linearly with the time required to read the data {(ai; yi)}i=1. Specifically, TGGF proceeds in two stages: s1) A novel orthogonality-promoting initialization that is obtained with simple power iterations; and, s2) a refinement of the initial estimate by successive updates of scalable truncated generalized gradient iterations. The former is in sharp contrast to the existing spectral initializations, while the latter handles the rather challenging nonconvex and nonsmooth amplitude-based cost function. Empirical results demonstrate that: i) The novel orthogonalitypromoting initialization method returns more accurate and robust estimates relative to its spectral counterparts; and, ii) even with the same initialization, our refinement/truncation outperforms Wirtinger-based alternatives, all corroborating the superior performance of TGGF over state-of-the-art algorithms.
منابع مشابه
An accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations
In this paper, an accelerated gradient based iterative algorithm for solving systems of coupled generalized Sylvester-transpose matrix equations is proposed. The convergence analysis of the algorithm is investigated. We show that the proposed algorithm converges to the exact solution for any initial value under certain assumptions. Finally, some numerical examples are given to demons...
متن کاملReshaped Wirtinger Flow for Solving Quadratic Systems of Equations
We study the problem of recovering a vector x ∈ R from its magnitude measurements yi = |〈ai,x〉|, i = 1, ..., m. Our work is along the line of the Wirtinger flow (WF) approach [1], which solves the problem by minimizing a nonconvex loss function via a gradient algorithm and can be shown to converge to a global optimal point under good initialization. In contrast to the smooth loss function used ...
متن کاملReshaped Wirtinger Flow for Solving Quadratic System of Equations
We study the problem of recovering a vector x ∈ R from its magnitude measurements yi = |〈ai,x〉|, i = 1, ...,m. Our work is along the line of the Wirtinger flow (WF) approach Candès et al. [2015], which solves the problem by minimizing a nonconvex loss function via a gradient algorithm and can be shown to converge to a global optimal point under good initialization. In contrast to the smooth los...
متن کاملGradient Descent with Random Initialization: Fast Global Convergence for Nonconvex Phase Retrieval
This paper considers the problem of solving systems of quadratic equations, namely, recovering an object of interest x ∈ R from m quadratic equations / samples yi = (ai x), 1 ≤ i ≤ m. This problem, also dubbed as phase retrieval, spans multiple domains including physical sciences and machine learning. We investigate the efficiency of gradient descent (or Wirtinger flow) designed for the nonconv...
متن کاملA Three-terms Conjugate Gradient Algorithm for Solving Large-Scale Systems of Nonlinear Equations
Nonlinear conjugate gradient method is well known in solving large-scale unconstrained optimization problems due to it’s low storage requirement and simple to implement. Research activities on it’s application to handle higher dimensional systems of nonlinear equations are just beginning. This paper presents a Threeterm Conjugate Gradient algorithm for solving Large-Scale systems of nonlinear e...
متن کامل